/**
*      author: Y_Yao
*      created: 2025-02-12 20:25:05
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 6;
int n,m,k;


void solve()
{
    cin >> n >> m >> k;
    char mx = n > m ? '0' : '1';
    char mi;
    if(mx == '0') mi = '1';
    else mi = '0';
    if(m > n)
    {
        swap(m,n);
    }
    if(n < k || n - m > k)
    {
        cout << -1 << endl;
        return;
    }

    string s;
    int tn = n,tm = m;
    for(int i = 1;i <= k;i++)
    {
        s += mx;
        tn--;
    }
    while(tn != 0 && tm != 0)
    {
        s += mi;
        s += mx;
        tn--;
        tm--;
    }
    while(tm != 0)
    {
        s += mi;
        tm--;
    }
    cout << s << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}